Distributed Abstract State Machines Status Report of a Doctoral Thesis
نویسندگان
چکیده
In 1985, Gurevich introduced Abstract State Machines (ASMs) as a computational model more powerful and universal than classical computational models. Since then ASMs have been applied successfully both in theory and practice: On the theoretical side, ASMs evolved to a general basis for the study of different classes of algorithms and their expressive power. On the practical side, ASMs have been extended to a full-fledged design methodology, applied successfully in industry for the specification and analysis of real-world systems. In my doctoral thesis I examine the class of distributed ASMs and study their expressive power. I also intend to develop basic notions of refinement and composition for distributed ASMs.
منابع مشابه
Recursive Abstract State Machines
According to the ASM thesis, any algorithm is essentially a Gurevich abstract state machine. The only objection to this thesis, at least in its sequential version, has been that ASMs do not capture recursion properly. To this end, we suggest recursive ASMs.
متن کاملA Comparative Study of the Defense of Nursing PhD Thesis in Iran and Top United States Universities
Background : The most important event in the doctoral course is the completion and defense of the dissertation, which leads to learning and improving the necessary skills to conduct research and improve performance in the field. Evaluating a doctoral dissertation defense program helps to identify the strengths and weaknesses of this process. Therefore, this comparative study has investigated th...
متن کاملA Sound and Complete SOS-Semantics for Non-Distributed Deterministic Abstract State Machines
In this paper we present a sound and complete Structural Operational Semantics (SOS) for non-distributed deterministic Abstract State Machines (ASMs). Since ASMs exhibit both sequential and parallel features, the semantics is structured into two layers. One layer describes the parallel execution of updates, the other layer describes the sequential execution of rules. The semantics has some nice...
متن کاملResearch as transition instrument: A phenomenological investigation of future image in Ph.D. thesis writing
This research has been done to investigate Shiraz university doctoral students’ perspectives on thesis writing. Required data has been gathered by using deep interviews with eight doctoral students. Based on an abductive research strategy and using interpretative phenomenology, the research findings show a Ph.D. thesis doesn’t have a place in the big picture of their life. Themes abstracted fro...
متن کاملInteractive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem
In earlier work, the Abstract State Machine Thesis — that arbitrary algorithms are behaviorally equivalent to abstract state machines — was established for several classes of algorithms, including ordinary, interactive, small-step algorithms. This was accomplished on the basis of axiomatizations of these classes of algorithms. In a companion paper [5] the axiomatisation was extended to cover in...
متن کامل